Shuue Languages Are in P
نویسنده
چکیده
In this paper we show that shuue languages are contained in one-way-NSPACE(logn) thus in P. We consider the class of shuue languages which emerges from the class of nite languages through regular operations (union, concatenation, Kleene star) and shuue operations (shuue and shuue closure). For every shuue expression E we construct a shuue automaton which accepts the language generated by E and we show that the automaton can be simulated by a one-way nondeterministic Turing machine in logarithmic space.
منابع مشابه
Synchronized Shuue and Regular Languages Synchronized Shuue and Regular Languages
New representation results for three families of regular languages are stated, using a special kind of shuue operation, namely the synchronized shuue. First, it is proved that the family of regular star languages is the smallest family containing the language (a + bc) and closed under synchronized shuue and length preserving morphism. The second representation result states that the family of "...
متن کاملAn approximation of reductional equivalence
We deene an equivalence relation on-terms called shuue-equivalence which attempts to capture the notion of reductional equivalence on strongly normalizing terms. The shuue-equivalence classes are shown to divide the classes of-equal terms into smaller ones consisting of terms with similar reduction behaviour. We reene-reduction from a relation on terms to a relation on shuue-equivalence classes...
متن کاملKnow When to Hold 'Em: Shu ing Deterministically in a Parser for Nonconcatenative Grammars
Nonconcatenative constraints, such as the shuue relation , are frequently employed in grammatical analyses of languages that have more exible ordering of constituents than English. We show how it is possible to avoid searching the large space of permutations that results from a nondeterministic application of shuue constraints. The results of our implementation demonstrate that deterministic ap...
متن کاملPAC Learning of Interleaved Melodies
A number of algebraic models of music that use the interleaving or shuue operator have been suggested in the literature. This paper shows how interleaving expressions are conducive to PAC identiication. PAC learning theory states that a \probably approximately correct" hypothesis that falls within a desired level of accuracy can be derived with a high probability from randomly selected training...
متن کاملPac Learning of Interleaved Melodies (revised)
A number of algebraic models of music that use the interleaving or shuue operator have been suggested in the literature. This paper shows how interleaving expressions are conducive to PAC identiication. PAC learning theory states that a \probably approximately correct" hypothesis that falls within a desired level of accuracy can be derived with a high probability from randomly selected training...
متن کامل